A Gambler that Bets Forever and the Strong Law of Large Numbers

نویسندگان

چکیده

In this expository note, we give a simple proof that gambler repeating game with positive expected value never goes broke probability. This does not immediately follow from the strong law of large numbers or other basic facts on random walks. Using result, provide an elementary numbers. The ideas proofs come maximal ergodic theorem and Birkhoff’s theorem.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Strong Law of Large Numbers

Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...

متن کامل

On the Strong Law of Large Numbers

N lim 1( 1: f(nkx)) = 0, N-N k_l or roughly speaking the strong law of large numbers holds for f(nkx) (in fact the authors prove that Ef(nkx)/k converges almost everywhere) . The question was raised whether (2) holds for any f(x) . This was known for the case nk=2k( 2) . In the present paper it is shown that this is not the case . In fact we prove the following theorem . THEOREM 1 . There exist...

متن کامل

MARCINKIEWICZ-TYPE STRONG LAW OF LARGE NUMBERS FOR DOUBLE ARRAYS OF NEGATIVELY DEPENDENT RANDOM VARIABLES

In the following work we present a proof for the strong law of large numbers for pairwise negatively dependent random variables which relaxes the usual assumption of pairwise independence. Let be a double sequence of pairwise negatively dependent random variables. If for all non-negative real numbers t and , for 1 < p < 2, then we prove that (1). In addition, it also converges to 0 in ....

متن کامل

On the strong law of large numbers and additive functions

Let f(n) be a strongly additive complex-valued arithmetic function. Under mild conditions on f , we prove the following weighted strong law of large numbers: if X, X1, X2, . . . is any sequence of integrable i.i.d. random variables, then lim N→∞ ∑N n=1 f(n)Xn ∑N n=1 f(n) = EX a.s.

متن کامل

A strong law of large numbers in credibility theory∗

In this paper, the issue of the law of large numbers for fuzzy variables is considered. Since in credibility theory convergence in credibility implies convergence almost sure, the strong law of large numbers is defined via convergence in credibility, while the weak law of large numbers is defined through convergence almost sure. Based on the convergence results about the unform integrability of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Mathematical Monthly

سال: 2021

ISSN: ['1930-0972', '0002-9890']

DOI: https://doi.org/10.1080/00029890.2022.2005438